Paul Swoboda
29 publications
8 venues
H Index 8
Affiliation
Heinrich-Heine Universit t D sseldorf, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
Joint Self-Supervised Image-Volume Representation Learning with Intra-inter Contrastive Clustering.
|
AAAI | 2023 | 0 |
| ClusterFuG: Clustering Fully connected Graphs by Multicut.
|
ICML | 2023 | 0 |
| LVM-Med: Learning Large-Scale Self-Supervised Vision Models for Medical Imaging via Second-order Graph Matching.
|
NIPS/NeurIPS | 2023 | 0 |
| A Multidimensional Analysis of Social Biases in Vision Transformers.
|
ICCV | 2023 | 0 |
| A Comparative Study of Graph Matching Algorithms in Computer Vision.
|
ECCV | 2022 | 1 |
| A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching.
|
CVPR | 2022 | 1 |
| RAMA: A Rapid Multicut Algorithm on GPU.
|
CVPR | 2022 | 0 |
| FastDOG: Fast Discrete Optimization on GPU.
|
CVPR | 2022 | 0 |
| LMGP: Lifted Multicut Meets Geometry Projections for Multi-Camera Multi-Object Tracking.
|
CVPR | 2022 | 0 |
| Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths.
|
ICCV | 2021 | 15 |
| Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approach.
|
NIPS/NeurIPS | 2021 | 4 |
| Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams.
|
ICML | 2021 | 0 |
| A Primal-Dual Solver for Large-Scale Tracking-by-Assignment.
|
AISTATS | 2020 | 4 |
| Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers.
|
ECCV | 2020 | 63 |
| Lifted Disjoint Paths with Application in Multiple Object Tracking.
|
ICML | 2020 | 79 |
| A Convex Relaxation for Multi-Graph Matching.
|
CVPR | 2019 | 28 |
| Bottleneck Potentials in Markov Random Fields.
|
ICCV | 2019 | 2 |
| Combinatorial Persistency Criteria for Multicut and Max-Cut.
|
CVPR | 2019 | 0 |
| MAP Inference via Block-Coordinate Frank-Wolfe Algorithm.
|
CVPR | 2019 | 0 |
| HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching.
|
ICCV | 2019 | 0 |
| Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation.
|
AAAI | 2018 | 8 |
| Maximum Persistency via Iterative Relaxed Inference in Graphical Models.
|
TPAMI | 2018 | 0 |
| A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.
|
CVPR | 2017 | 0 |
| A Message Passing Algorithm for the Minimum Cost Multicut Problem.
|
CVPR | 2017 | 0 |
| A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching.
|
CVPR | 2017 | 0 |
| Partial Optimality by Pruning for MAP-Inference with General Graphical Models.
|
TPAMI | 2016 | 0 |
| Maximum persistency via iterative relaxed inference with graphical models.
|
CVPR | 2015 | 21 |
| Partial Optimality by Pruning for MAP-Inference with General Graphical Models.
|
CVPR | 2014 | 26 |
| Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation.
|
NIPS/NeurIPS | 2013 | 20 |